Termination w.r.t. Q proof of TRS/SK902.18.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

sum(0) → 0
sum(s(x)) → +(sum(x), s(x))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

sum(0) → 0
sum(s(x)) → +(sum(x), s(x))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

sum₁ > +₂ > s₁

Status:

trivial